Multi-Channel Modulo Samplers Constructed from Gaussian Integers

On transitive polynomials modulo integers

A polynomial P (x) with integer coefficients is said to be transitive modulo m, if for every x, y ∈ Z there exists k ≥ 0 such that P (x) = y (mod m). In this paper, we construct new examples of transitive polynomials modulo prime powers and partially describe cubic and quartic transitive polynomials. We also study the orbit structure of affine maps modulo prime powers.

Gaussian Integers

We will investigate the ring of ”Gaussian integers” Z[i] = {a + bi | a, b ∈ Z}. First we will show that this ring shares an important property with the ring of integers: every element can be factored into a product of finitely many ”primes”. This result is the key to all the remaining concepts in this paper, which includes the ring Z[i]/αZ[i], analogous statements of famous theorems in Z, and q...

Gaussian Integers

Gaussian integer is one of basic algebraic integers. In this article we formalize some definitions about Gaussian integers [27]. We also formalize ring (called Gaussian integer ring), Z-module and Z-algebra generated by Gaussian integer mentioned above. Moreover, we formalize some definitions about Gaussian rational numbers and Gaussian rational number field. Then we prove that the Gaussian rat...

The Ring of Integers, Euclidean Rings and Modulo Integers

The binary operation multint on Z is defined as follows: (Def. 1) For all elements a, b of Z holds (multint)(a, b) = ·R(a, b). The unary operation compint on Z is defined as follows: (Def. 2) For every element a of Z holds (compint)(a) = −R(a). The double loop structure INT.Ring is defined by: (Def. 3) INT.Ring = 〈Z, +Z,multint, 1(∈ Z), 0(∈ Z)〉. Let us mention that INT.Ring is strict and non em...

Multi-antenna Gaussian Channel (MIMO)